A Symmetric Paired Shipment Algorithm with Concert Agreement for Distributed Hash Space in Vehicular Ad-Hoc Networks

Vehicles participating in the mobile network may host different number of virtual servers and they are enable to balance their load in the reallocation of different vehicles. Most decentralized load blancing algorithms designed for adhoc networks based on their virtual servers requires the vehicle to be asymmetric, where as some serve as the rendezvous vehicle to pair virtual servers and participating peers, there by introducing another load balancing problem. While symmetric load balancing algorithms, introduce significant algorithmic overheads and guarantee no throughput and performance metrics. In this paper, A Novel Symmetric load balancing algorithm for adhoc network is resented by having the participating vehicles to approximate the system with global index. Each vehicle independently reallocates in our proposal its locally hosted virtual servers by advertising and inquiring the global index based on their current location. Unlike competitive algorithms, our proposal exhibits performance guarantees in terms of throughput, security and load balance factor and the algorithmic convergence rate and introduces no load imbalance problem due to the algorithmic workload. Through NS2 Simulation we show that our proposed work outperforms existing algorithms in terms of load balancing in vehicular adhoc network with a comparable movement cost.